There are many different semantics for general logic programs (i.e. programsthat use negation in the bodies of clauses). Most of these semantics are Turingcomplete (in a sense that can be made precise), implying that they areundecidable. To obtain decidability one needs to put additional restrictions onprograms and queries. In logic programming it is natural to put restrictions onthe underlying first-order language. In this note we show the decidability ofthe Clark's completion semantics for monadic general programs and queries. To appear in Theory and Practice of Logic Programming (TPLP)
展开▼
